Infinite Number of Chaotic Generalized Sub-shifts of Cellular Automaton Rule 180
نویسندگان
چکیده
This paper is devoted to an in-depth study of cellular automaton rule 180 under the framework of symbolic dynamics. Rule 180, a member of Wolfram’s class IV and Chua’s hyper Bernoulli shift rules, defines infinite number of generalized sub-shifts. An effective method of constructing the shift invariant sets of the rule’s global map is proposed. It is noted that this method is also applicable to studying the dynamics of other rules. Furthermore, the rich and complex dynamical behaviors on these sub-shifts, such as positive topological entropies, topologically mixing, and chaos in the sense of Li-Yorke and Devaney, are revealed.
منابع مشابه
COUNTEREXAMPLES IN CHAOTIC GENERALIZED SHIFTS
In the following text for arbitrary $X$ with at least two elements, nonempty countable set $Gamma$ we make a comparative study on the collection of generalized shift dynamical systems like $(X^Gamma,sigma_varphi)$ where $varphi:GammatoGamma$ is an arbitrary self-map. We pay attention to sub-systems and combinations of generalized shifts with counterexamples regarding Devaney, exact Dev...
متن کاملAnalysis of Elementary Cellular Automata Chaotic Rules Behavior
We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic cylindrical configuration. The focus is to determine whether Cellular Automata (CA) is suitable for the generation of pseudo random number sequences (PRNs) of cryptographic strength. Additionally, we identify the rules that are most suitable for such applications. It is found that only two sub-clusters...
متن کاملDynamics of Wolfram’s Class III Cellular Automaton Rule 73
In this paper, the dynamics of elementary cellular automaton (ECA) rule 73 is investigated under the framework of the bi-infinite symbolic sequence space. This paper provides a rigorous mathematical analysis for the evolution of symbol sequences in some subsystems of rule 73. ECA rule 73, a member of Wolfram’s class III and Chua’s complex Bernoulli-shift rules, defines many more subsystems with...
متن کاملHamming Distance and Data Compression of 1-D CA
In this paper an application of von Neumann correction technique to the output string of some chaotic rules of 1-D Cellular Automata that are unsuitable for cryptographic pseudo random number generation due to their non uniform distribution of the binary elements is presented. The one dimensional (1-D) Cellular Automata (CA) Rule space will be classified by the time run of Hamming Distance (HD)...
متن کاملLI-YORKE CHAOTIC GENERALIZED SHIFT DYNAMICAL SYSTEMS
In this text we prove that in generalized shift dynamical system $(X^Gamma,sigma_varphi)$ for finite discrete $X$ with at least two elements, infinite countable set $Gamma$ and arbitrary map $varphi:GammatoGamma$, the following statements are equivalent: - the dynamical system $(X^Gamma,sigma_varphi)$ is Li-Yorke chaotic; - the dynamical system $(X^Gamma,sigma_varphi)$ has an scr...
متن کامل